TKFIM: Top-K frequent itemset mining technique based on equivalence classes
نویسندگان
چکیده
منابع مشابه
Mining the Top - K Frequent Itemset with Minimum Length
......................................................................................................................... iii Acknowledgements ....................................................................................................... iv Dedication....................................................................................................................... v List of Tables ...
متن کاملEfficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets
Association rule discovery based on support-confidence framework is an important task in data mining. However, the occurrence frequency (support) of a pattern (itemset) may not be a sufficient criterion for discovering interesting patterns. Temporal regularity, which can be a trace of behavior, with frequency behavior can be revealed as an important key in several applications. A pattern can be...
متن کاملThe Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem
In this paper, we introduce a new problem, called Top-k SAT, that consists in enumerating the Top-k models of a propositional formula. A Top-k model is defined as a model with less than k models preferred to it with respect to a preference relation. We show that Top-k SAT generalizes two well-known problems: the partial Max-SAT problem and the problem of computing minimal models. Moreover, we p...
متن کاملRIP Technique for Frequent Itemset Mining
Data mining is a rapidly expanding field being applied in many disciplines, ranging from remote sensing to geographical information systems, computer cartography, environmental assessment and planning. Rule mining is a powerful technique used to discover interesting associations between attributes contained in a database (Han et al., 2006). Association rules can have one or several output attri...
متن کاملMining Frequent Sequences Using Itemset-Based Extension
In this paper, we systematically explore an itemset-based extension approach for generating candidate sequence which contributes to a better and more straightforward search space traversal performance than traditional item-based extension approach. Based on this candidate generation approach, we present FINDER, a novel algorithm for discovering the set of all frequent sequences. FINDER is compo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PeerJ Computer Science
سال: 2021
ISSN: 2376-5992
DOI: 10.7717/peerj-cs.385